Nonclassical Mereology and Its Application to Sets
نویسنده
چکیده
Part One of this paper is a case against classical mereology and for Heyting mereology. This case proceeds by first undermining the appeal of classical mereology and then showing how it fails to cohere with our intuitions about a measure of quantity. Part Two shows how Heyting mereology provides an account of sets and classes without resort to any nonmereological primitive.
منابع مشابه
Weighted similarity measure on interval-valued fuzzy sets and its application to pattern recognition
A new approach to define the similarity measure betweeninterval-valued fuzzy sets is presented. The proposed approach isbased on a weighted measure in which the normalized similaritiesbetween lower functions and also between upper functions arecombined by a weight parameter. The properties of this similaritymeasure are investigated. It is shown that, the proposed measurehas some advantages in c...
متن کاملHorizontal representation of a hesitant fuzzy set and its application to multiple attribute decision making
The main aim of this paper is to present a novel method for ranking hesitant fuzzy sets (HFSs) based on transforming HFSs into fuzzy sets (FSs). The idea behind the method is an interesting HFS decomposition which is referred here to as the horizontal representation in the current study. To show the validity of the proposed ranking method, we apply it to solve a multi-attribute decision-making ...
متن کاملRough Mereology in Analysis of Vagueness
This work aims at presenting to a wider audience fundamental notions and ideas of rough mereology. We discuss various methods for constructing rough inclusions in data sets, then we show how to apply them to the task of knowledge granulation, and finally, we introduce granular reflections of data sets with examples of classifiers built on them.
متن کاملComputational Intelligence in Knowledge Technology
The first paper by Polkowski and Artiemjew, entitled “On Knowledge Granulation and Applications to Classifier Induction in the Framework of Rough Mereology” presents basic ideas of rough mereology and a description of basic similarity measures called rough inclusions along with the idea of granulated data sets. It then discusses how to construct classifiers from granular data and obtain results...
متن کاملRough-Neuro Computing
We outline a rough–neuro computing model as a basis for granular computing. Our approach is based on rough sets, rough mereology and information granule calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 43 شماره
صفحات -
تاریخ انتشار 2002